Correctness of recursive parallel nondeterministic flow programs
نویسندگان
چکیده
منابع مشابه
Correctness and Refinement of Dually Nondeterministic Programs
In this paper we extend different reasoning methods from traditional (demonic) programs to programs with both demonic and angelic nondeterminism. In particular, we discuss correctness proofs, and refinement of programs while reducing angelic nondeterminism (into demonic nondeterminism or determinism). As expected, reducing angelic nondeterminism is generally not a refinement; however, when cont...
متن کاملTermination of Nondeterministic Recursive Probabilistic Programs
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination time over all schedulers). Our result also clarifies previous results which claimed that ranking supermartingales are not a complete approach even for nondeter...
متن کاملSeparating Functional and Parallel Correctness using Nondeterministic Sequential Specifications
Writing correct explicitly-parallel programs can be very challenging. While the functional correctness of a program can often be understood largely sequentially, a software engineer must simultaneously reason about the nondeterministic parallel interleavings of the program’s threads of execution. This complication is similarly a challenge to automated verification efforts. Thus, we argue that i...
متن کاملEfficient Parallel Execution of Irregular Recursive Programs
Programs whose parallelism stems from multiple re-cursion form an interesting subclass of parallel programs with many practical applications. The highly irregular shape of many recursion trees makes it dif-cult to obtain good load balancing with small overhead. We present a system called REAPAR that automatically parallelizes recursive C programs for SMP machines. Based on data from a single pr...
متن کاملPARES – A Model for Parallel Recursive Programs
PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs. Base on these theories we define a model of parallel computation with a very high level of abstraction – PARES (Parallel Recursive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1983
ISSN: 0022-0000
DOI: 10.1016/0022-0000(83)90043-0